Expected Delay Analysis of Polling Systems in Heavy Traffic

نویسنده

  • R. D. VAN DER MEI
چکیده

We study the expected delay in a cyclic polling model with mixtures of exhaustive and gated service in heavy traffic. We obtain closed-form expressions for the mean delay under standard heavy-traffic scalings, providing new insights into the behaviour of polling systems in heavy traffic. The results lead to excellent approximations of the expected waiting times in practical heavy-load scenarios and moreover, lead to new results for optimizing the system performance with respect to the service disciplines.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polling models with renewal arrivals: A new method to derive heavy-traffic asymptotics

We consider asymmetric cyclic polling systems with an arbitrary number of queues, general service-time distributions, zero switch-over times, gated service at each queue, and with general renewal arrival processes at each of the queues. For this classical model, we propose a new method to derive closed-form expressions for the expected delay at each of the queues when the load tends to 1, under...

متن کامل

Polling systems in heavy traffic: Exhaustiveness of service policies

We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we cal...

متن کامل

Heavy traffic analysis of polling models by mean value analysis

In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We consider the classical cyclic polling model with exhaustive or gated service at each queue, and with general service-time and switch-over time distributions, and study its behavior when the load tends to one. For this model, we explore the recently proposed mean value analysis (MVA), which takes a...

متن کامل

Polling Models with Two-Stage Gated Service: Fairness Versus Efficiency

We consider an asymmetric cyclic polling system with general service-time and switchover time distributions with so-called two-stage gated service at each queue, an interleaving scheme that aims to enforce fairness among the different customer classes. For this model, we (1) obtain a pseudo-conservation law, (2) describe how the mean delay at each of the queues can be obtained recursively via t...

متن کامل

A note on polling models with renewal arrivals and nonzero switch-over times

We consider polling systems with general service times and switch-over times, gated service at all queues and with general renewal arrival processes. We derive closed-form expressions for the expected delay in heavy-traffic (HT). So far, rigorous proofs of HT limits have only been obtained for Poisson-type arrival processes, whereas for renewal arrivals HT limits are based on conjectures [5, 6,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002